Directional Clustering Through Matrix Factorization
نویسندگان
چکیده
منابع مشابه
Directional Clustering through Matrix Factorisation
In this paper we are interested in directional clustering, that is, in grouping of feature vectors depending on their direction, so that the angles between pairs of features from the same cluster are small. The assignment of features to clusters is here cast as a constrained low-rank matrix factorisation problem, which can be solved using ideas similar to those used to compute similar matrix fa...
متن کاملData Clustering And Visualization Through Matrix Factorization
ACKNOWLEDGMENTS First of all, I would like to express my special appreciation to my advisor, Dr. Ming Dong, for his guide of my professional development and an inexhaustible source of ideas through my Ph.D.program at Wayne State University. During these years, he has spent tremendous time and effort with me discussing research, teaching me to write papers, and answering my questions. Without hi...
متن کاملSemi-Supervised Clustering via Matrix Factorization
The recent years have witnessed a surge of interests of semi-supervised clustering methods, which aim to cluster the data set under the guidance of some supervisory information. Usually those supervisory information takes the form of pairwise constraints that indicate the similarity/dissimilarity between the two points. In this paper, we propose a novel matrix factorization based approach for s...
متن کاملSymmetric Nonnegative Matrix Factorization for Graph Clustering
Nonnegative matrix factorization (NMF) provides a lower rank approximation of a nonnegative matrix, and has been successfully used as a clustering method. In this paper, we offer some conceptual understanding for the capabilities and shortcomings of NMF as a clustering method. Then, we propose Symmetric NMF (SymNMF) as a general framework for graph clustering, which inherits the advantages of N...
متن کاملClustering by Left-Stochastic Matrix Factorization
We propose clustering samples given their pairwise similarities by factorizing the similarity matrix into the product of a cluster probability matrix and its transpose. We propose a rotation-based algorithm to compute this left-stochastic decomposition (LSD). Theoretical results link the LSD clustering method to a soft kernel k-means clustering, give conditions for when the factorization and cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2016
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2015.2505060